Online Schedulability Tests for Real-Time Systems

نویسندگان

  • Ana Carolina Sokolonski
  • Eduardo Camponogara
چکیده

Modern real-time systems have to be adaptable and flexible to deal with non-periodic events, requiring a means of checking for schedulability during execution time. Thus, online schedulability tests are a fundamental building block in the design of such systems. Usually, when such tests are carried out at time t they either consider or not future events that occur after t. Those that take such events into consideration are based on previously derived offline scheduling. Otherwise, they focus only on the jobs that are active at t. Unlike these usual approaches, we describe in this paper two online tests that verify schedulability within a given time interval [t, t′) so that future event occurrences are considered but bounded within the interval. The tests are proved correct and are evaluated by simulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Online Schedulability Tests for Real-Time Systems

Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for on-line admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. On the other hand, most precise schedulability t...

متن کامل

The Space of Rate Monotonic Schedulability

Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic tasks. They can be divided in two main classes: polynomial time tests and exact tests. Polynomial time tests are used for on-line guarantee of dynamic systems, where tasks can be activated at runtime. These tests introd...

متن کامل

Multiprocessor Schedulability Analysis for Self - Suspending Task Systems ∗

In many real-time systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored and is thought to be difficult (as it is on uniprocessors). In this paper, hard/soft multiprocessor schedulability tests for arbitrary-deadline sporadic self-suspending task systems are presented for both global EDF and ...

متن کامل

A Generic Approach to Schedulability Analysis of Real-Time Tasks

In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with fixed rates. To relax the assumption of complete knowledge on arrival times, we propose to use timed automata to describe task arrival patterns. In a recent work, it is shown that for fixed priority scheduling strategy and tasks with only timing constraints (i.e. executi...

متن کامل

The Multiprocessor Real-Time Scheduling of General Task Systems

NATHAN WAYNE FISHER: The Multiprocessor Real-Time Scheduling of General Task Systems. (Under the direction of Sanjoy K. Baruah.) The recent emergence of multicore and related technologies in many commercial systems has increased the prevalence of multiprocessor architectures. Contemporaneously, real-time applications have become more complex and sophisticated in their behavior and interaction. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008